An Adaptive K-random Walks Method for Peer-to-Peer Networks
نویسنده
چکیده
Designing an intelligent search method in peer-to-peer networks will significantly affect efficiency of the network taking into account sending a search query to nodes which have more probably stored the desired object. Machine learning techniques such as learning automaton can be used as an appropriate tool for this purpose. This paper tries to present a search method based on the learning automaton for the peer-to-peer networks, in which each node is selected according to values stored in its memory for sending the search queries rather than being selected randomly. The probable values are stored in tables and they indicate history of the node in previous searches for finding the desired object. For evaluation, simulation is used to demonstrate that the proposed algorithm outperforms K-random walk method which randomly sends the search queries to the nodes.
منابع مشابه
Mobile Agent-Based Approach for Resource Discovery in Peer-to-Peer Networks
Peer-to-peer networks are distributed computing infrastructures that can provide globally available network resources. Their size and complexity continue to increase and permit an almost ubiquitous availability of resources. Therefore, new discovery approaches are required and need to be highly flexible in order to cope with a dynamically changing environment. In this paper, a distributed agent...
متن کاملRandom walks in peer-to-peer networks: Algorithms and evaluation
We quantify the effectiveness of random walks for searching and construction of unstructured peer-to-peer (P2P) networks. We have identified two cases where the use of random walks for searching achieves better results than flooding: (a) when the overlay topology is clustered, and (b) when a client re-issues the same query while its horizon does not change much. Related to the simulation of ran...
متن کاملSimple Random Walks on Radio Networks (Simple Random Walks on Hyper-Graphs)
In recent years, protocols that are based on the properties of random walks on graphs have found many applications in communication and information networks, such as wireless networks, peer-to-peer networks and the Web. For wireless networks (and other networks), graphs are actually not the correct model of the communication; instead hyper-graphs better capture the communication over a wireless...
متن کاملUsing Random Walks to Find Resources in Unstructured Self-Organized P2P Networks∗
In this paper we present on-going work on the use of random walks as the basic mechanism to locate resources in Peer-to-Peer (P2P) systems. In this work we combine random walks with a self-organization of the overlay network, which dynamically adapts the topology of the network to the load of the system. We present the self-organization techniques we have proposed, and show by empirical evaluat...
متن کاملA Novel Learning-based Search Algorithm for Unstructured Peer to Peer Networks
In order to file sharing as a popular application of unstructured peer to peer networks, finding a certain amount of data in each node, needs performing an appropriate search method. In this paper, we propose a new version of k-random walk algorithm using learning automata. In the proposed method, the value of k for k-random walk is not selected randomly but it is selected in an adaptive manner...
متن کامل